GPU Robot Motion Planning Using Semi-Infinite Nonlinear Programming
نویسندگان
چکیده
منابع مشابه
Robot trajectory planning with semi-infinite programming
In this paper we describe how robot trajectory planning can be formulated as a semi-infinite programming (SIP) problem. The formulation as a SIP problem allowed us to treat the problem with one of the three main classes of methods for solving SIP, the discretization class. Two of the robotics trajectory planning problems formulated were coded in the SIPAMPL [1] environment which is publicly ava...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملRobot Platform Motion Planning using Answer Set Programming
We discuss how a path planning problem for a robotic platform was solved modeling it with the axioms of the action language AL and described in Answer Set Programming, ASP. The environment of the autonomous vehicle is static. A set of dynamic, static and inertial laws are used to describe the vehicle domain. The optimum solution is chosen using two criteria: minimum distance and minimum obstacl...
متن کاملOptimal Motion Planning for Manipulator Arms Using Nonlinear Programming
The optimal motion planning problems for manipulator arms have been actively researched in robotics in the past two or three decades because the optimal motions that minimize actuator forces, energy consumption, or motion time yield high productivity, efficiency, smooth motion, durability of machine parts, etc. These merits are more apparent when the manipulator arms execute repeated motions. T...
متن کاملSemi-infinite programming
A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a compromise between an introduction and a survey, treats the theoretical basis, numerical methods, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2016
ISSN: 1045-9219
DOI: 10.1109/tpds.2016.2521373